Balancing equal weights on the integer line
نویسندگان
چکیده
منابع مشابه
RANKING DMUS ON THE BENCHMARK LINE WITH EQUAL SHADOW PRICES
Data envelopment analysis (DEA) with considering the best condition for each decision making unit (DMU) assesses the relative efficiency for it and divides a homogenous group of DMUs in to two categories: efficient and inefficient, but traditional DEA models can not rank efficient DMUs. Although some models were introduced for ranking efficient DMUs, Franklin Lio & Hsuan peng (2008), proposed a...
متن کاملInteger equal flows
The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R1, . . . , R` must carry equal flow. We show that this problem is effectively inapproximable, even if the cardinality of each set Rk is two. When ` is fixed, it is solvable in polynomial time. © 2009 Elsevier B.V. All rights reserved.
متن کاملOn-line Load Balancing
The setup for our problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a diierent level of service, and once assigned can not be reassigned. We make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each ...
متن کاملAssembly line balancing to minimize balancing loss and system loss
Assembly Line production is one of the widely used basic principles in production system. The problem of Assembly Line Balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. Research works reported in the literature mainly deals with minimization of idle time i.e...
متن کاملranking dmus on the benchmark line with equal shadow prices
data envelopment analysis (dea) with considering the best condition for each decision making unit (dmu) assesses the relative efficiency for it and divides a homogenous group of dmus in to two categories: efficient and inefficient, but traditional dea models can not rank efficient dmus. although some models were introduced for ranking efficient dmus, franklin lio & hsuan peng (2008), proposed a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1969
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(69)80047-5